Arc-transitive graphs of square-free order and small valency

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classifying Arc-Transitive Circulants of Square-Free Order

A circulant is a Cayley graph of a cyclic group Arc transitive circulants of square free order are classi ed It is shown that an arc transitive circulant of square free order n is one of the following the lexicographic product Kb or the deleted lexicographic Kb b where n bm and is an arc transitive circulant or is a normal circulant that is Aut has a normal regular cyclic subgroup

متن کامل

On Edge-Transitive Graphs of Square-Free Order

We study the class of edge-transitive graphs of square-free order and valency at most k. It is shown that, except for a few special families of graphs, only finitely many members in this class are basic (namely, not a normal multicover of another member). Using this result, we determine the automorphism groups of locally primitive arc-transitive graphs with square-free order.

متن کامل

Arc-transitive graphs of valency 8 have a semiregular automorphism∗

One version of the polycirculant conjecture states that every vertex-transitive graph has a non-identity semiregular automorphism that is, a non-identity automorphism whose cycles all have the same length. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open valency.

متن کامل

Half-arc-transitive graphs of order 4p of valency twice a prime

A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. Let p be a prime. Cheng and Oxley [On weakly symmetric graphs of order twice a prime, J. Combin. Theory B 42(1987) 196-211] proved that there is no half-arc-transitive graph of order 2p, and Alspach and Xu [ 12 -transitive graphs of order 3p, J. Algebraic Combin. 3(1994) 347-355] c...

متن کامل

Tetravalent Arc - Transitive Graphs of Order

Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p is given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2016

ISSN: 0012-365X

DOI: 10.1016/j.disc.2016.06.002